Construction of Capacity-Achieving Lattice Codes: Polar Lattices
نویسندگان
چکیده
In this paper, we propose a new class of lattices constructed from polar codes, namely polar lattices, to achieve the capacity 1 2 log(1+ SNR) of the additive white Gaussian-noise (AWGN) channel for any signal-to-noise ratio (SNR). Our construction follows the multilevel approach of Forney et al., where on each level we construct a capacityachieving polar code. The component polar codes are naturally nested, thereby fulfilling the requirement of the multilevel lattice construction. We prove that polar lattices are AWGN-good, in the sense that the error probability (for infinite lattice decoding) vanishes for any fixed volume-to-noise ratio (VNR) greater than 2πe. Furthermore, using the technique of source polarization, we propose discrete Gaussian shaping over the polar lattice to satisfy the power constraint. The proposed polar lattices permit low-complexity multistage successive cancellation decoding. Both the construction and shaping are explicit, and the overall complexity of encoding and decoding is O(N logN) for any fixed target error probability.
منابع مشابه
Polar Codes and Polar Lattices for the Heegard-Berger Problem
Explicit coding schemes are proposed to achieve the rate-distortion function of the Heegard-Berger problem using polar codes. Specifically, a nested polar code construction is employed to achieve the rate-distortion function for the doubly-symmetric binary sources when the side information may be absent. The nested structure contains two optimal polar codes for lossy source coding and channel c...
متن کاملPolar Lattices for Strong Secrecy Over the Mod-$\Lambda$ Gaussian Wiretap Channel
Polar lattices, which are constructed from polar codes, are provably good for the additive white Gaussian noise (AWGN) channel. In this work, we propose a new polar lattice construction that achieves the secrecy capacity under the strong secrecy criterion over the mod-Λ Gaussian wiretap channel. This construction leads to an AWGN-good lattice and a secrecy-good lattice simultaneously. The desig...
متن کاملMultilevel LDPC Lattices with Efficient Encoding and Decoding and a Generalization of Construction D'
Lattice codes are elegant and powerful structures that not only can achieve the capacity of the AWGN channel but also are a key ingredient to many multiterminal schemes that exploit linearity properties. However, constructing lattice codes that can realize these benefits with low complexity is still a challenging problem. In this paper, efficient encoding and decoding algorithms are proposed fo...
متن کاملTurbo Lattices: Construction and Error Decoding Performance
In this paper a new class of lattices called turbo lattices is introduced and established. We use the lattice Construction D to produce turbo lattices. This method needs a set of nested linear codes as its underlying structure. We benefit from turbo codes as our basis codes. Therefore, a set of nested turbo codes based on nested interleavers (block interleavers) and nested convolutional codes i...
متن کاملTurbo Lattices: Construction and Performance Analysis
In this paper a new class of lattices called turbo lattices is introduced and established. We use the lattice Construction D to produce turbo lattices. This method needs a set of nested linear codes as its underlying structure. We benefit from turbo codes as our basis codes. Therefore, a set of nested turbo codes based on nested interleavers and nested convolutional codes is built. To this end,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1411.0187 شماره
صفحات -
تاریخ انتشار 2014